Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection
نویسندگان
چکیده
Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood receiver, and yet with complexity similar to linear receivers. However, these lattice-reduction-aided detectors are based on the traditional LLL reduction algorithm that was originally introduced for reducing real lattice bases, in spite of the fact that the channel matrices are inherently complexvalued. In this paper, we introduce the complex LLL algorithm for direct application to reduce the basis of a complex lattice which is naturally defined by a complex-valued channel matrix. We prove that complex LLL reduction-aided detection can also achieve full diversity. Our analysis reveals that the new complex LLL algorithm can achieve a reduction in complexity of nearly 50% over the traditional LLL algorithm, and this is confirmed by simulation. It is noteworthy that the complex LLL algorithm aforementioned has nearly the same bit-error-rate performance as the traditional LLL algorithm.
منابع مشابه
Adaptive Switched Lattice Reduction-Aided Linear Detection Techniques for MIMO Systems
Lattice reduction (LR) aided multiple-inputmultiple-out (MIMO) linear detection can achieve the maximum receive diversity of the maximum likelihood detection (MLD). By emloying the most commonly used Lenstra, Lenstra, and L. Lov ́asz (LLL) algorithm, an equivalent channel matrix which is shorter and nearly orthogonal is obtained. And thus the noise enhancement is greatly reduced by employing the...
متن کاملLow-Complexity Near-Maximum-Likelihood Detection and Precoding for MIMO Systems using Lattice Reduction
We consider the lattice-reduction-aided detection scheme for 2×2 channels recently proposed by Yao and Wornell [11]. Using an equivalent real-valued substitute MIMO channel model their lattice reduction algorithm can be replaced by the well-known LLL algorithm, which enables the application to MIMO systems with arbitrary numbers of dimensions. We show how lattice reduction can also be favourabl...
متن کاملLattice Reduction-Based User Selection in Multiuser MIMO Systems
In wireless communications, the spectral efficiency can be improved by exploiting the space domain when antenna arrays are used. In particular, space-division multiple access (SDMA) [1–3] can be adopted with various beamforming techniques. If both the transmitter and the receiver are equipped with multiple antennas, the resulting channel becomes a multiple-input-multiple-output (MIMO) channel, ...
متن کاملApproximate maximum a posteriori detection for multiple-input-multiple-output systems with bit-level lattice reduction-aided detectors and successive interference cancellation
For iterative detection and decoding (IDD) in multiple-input–multiple-output (MIMO) systems, although the maximum a posteriori (MAP) detector can achieve an optimal performance, because of its prohibitively high computational complexity, various low-complexity approximate MAP detectors are studied. Among the existing MIMO detectors for the non-IDD receivers, lattice reduction (LR)-aided detecto...
متن کاملNew Factorization Algorithms for Channel-Factorization Aided MMSE Receiver in MIMO Systems
Channel-factorization aided detector (CFAD) is one of the important low-complexity detectors used in multiple input, multiple output (MIMO) receivers. Through channel factorization, this method transforms the original MIMO system into an equivalent system with a betterconditioned channel where detection is performed with a low-complexity detector; the estimate is then transferred back to the or...
متن کامل